NP Coordination in Underspecified Scope Representations
نویسنده
چکیده
Accurately capturing the quantifier scope behaviour of coordinated NPs can be problematic for some underspecified semantic representations. We present an extension to hole semantics that allows a natural representation of sentences containing NP coordination, and which correctly captures the quantifiers’ scoping behaviour. We demonstrate that existing efficient algorithms developed to solve constraints on semantic construction also apply to the proposed extension. This allows NP coordination to be represented in practical systems for semantic underspecification.
منابع مشابه
A Notion of Semantic Coherence for Underspecified Semantic Representation
The general problem of finding satisfying solutions to constraint-based underspecified representations of quantifier scope is NP-complete. Existing frameworks, including Dominance Graphs, Minimal Recursion Semantics, and Hole Semantics, have struggled to balance expressivity and tractability, in order to cover real natural language sentences with efficient algorithms. We address this trade-off ...
متن کاملOn Underspecified Processing of Dynamic Semantics
We propose a new inference system which operates on underspecified semantic representations of scope and anaphora. This system exploits anaphoric accessibility conditions from dynamic semantics to disambiguate scope ambiguities if possible. The main feature of the system is that it deals with underspecified descriptions directly, i.e. without enumerating readings.
متن کاملCompleteness and Computational Efficiency for Underspecified Representations ∗
Cooper (1983) pioneered underspecified scope representation in formal and computational semantics through his introduction of quantifier storage into Montague semantics as an alternative to the syntactic operation of quantifying-in. In this paper we address an important issue in the development of an adequate formal theory of underspecified semantics. The tension between expressive power and co...
متن کاملAn Improved Redundancy Elimination Algorithm for Underspecified Representations
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mutually equivalent readings. The algorithm operates on underspecified chart representations which are derived from dominance graphs; it can be applied to the USRs computed by largescale grammars. We evaluate the algorith...
متن کاملQuantification, Witness Sets and Conservativity
Theories of semantic scope underspecification can be divided into two types, depending on whether they are based on the notion of satisfaction or on the notion of derivation.1 The central tenet of satisfaction-based theories of scope underspecification is that the relation between a representation SR with fully specified scope relations and a representation UR with underspecified scope relation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006